lcp array造句

例句与造句

1. Rather than the actual LCP array, this algorithm builds the " permuted"
2. The algorithm is also rather simple ( < 100 LOC ) and can be enhanced to simultaneously construct the LCP array.
3. Thus, using suffix array and LCP array information, the decision query can be answered as fast as using the suffix tree.
4. The LCP array is also an essential part of compressed suffix trees which provide full suffix tree functionality like suffix links and lowest common ancestor queries.
5. In computer science, the "'longest common prefix array "'( LCP array ) is an auxiliary data structure to the suffix array.
6. It's difficult to find lcp array in a sentence. 用lcp array造句挺难的
7. ,the currently fastest linear-time LCP array construction algorithm is due to, which in turn is based on one of the fastest suffix array construction algorithms by.
8. As you said, the standard LCP array tells you the lcp of consecutive entries only, i . e . lcp ( x-1, x ) for any x.
9. The longest repeated substring problem for a string S of length n can be solved in \ Theta ( n ) time using both the suffix array A and the LCP array.
10. It is sufficient to perform a linear scan through the LCP array in order to find its maximum value v _ { max } and the corresponding index i where v _ { max } is stored.
11. Augmenting the suffix array with the LCP array allows one to efficiently simulate top-down and bottom-up traversals of the suffix tree, speeds up pattern matching on the suffix array and is a prerequisite for compressed suffix trees.
12. Moreover, there is a straightforward recursive algorithm to compute the 2 * N values of LCP-LR in O ( N ) time from the standard LCP array  I'd suggest posting a separate question if you need a detailed description of that.
13. Assuming that each text symbol takes one byte and each entry of the suffix or LCP array takes 4 bytes, the major drawback of their algorithm is a large space occupancy of 13n bytes, while the original output ( text, suffix array, LCP array ) only occupies 9n bytes.
14. Assuming that each text symbol takes one byte and each entry of the suffix or LCP array takes 4 bytes, the major drawback of their algorithm is a large space occupancy of 13n bytes, while the original output ( text, suffix array, LCP array ) only occupies 9n bytes.
15. The remainder of this section explains two applications of the LCP array in more detail : How the suffix array and the LCP array of a string can be used to construct the corresponding suffix tree and how it is possible to answer LCP queries for arbitrary suffixes using range minimum queries on the LCP array.
16. The remainder of this section explains two applications of the LCP array in more detail : How the suffix array and the LCP array of a string can be used to construct the corresponding suffix tree and how it is possible to answer LCP queries for arbitrary suffixes using range minimum queries on the LCP array.
更多例句：  下一页